Skip to content

Conversation

@Max-CoderBoi
Copy link

Why This is Optimal?

  • No extra hashmap (O(N) space reduced to O(1))
  • Time complexity remains O(N)
  • Modifies the tree temporarily but restores it

## **Why This is Optimal?**
- **No extra hashmap (`O(N) space reduced to O(1)`)**
- **Time complexity remains O(N)**
- **Modifies the tree temporarily but restores it**
@Max-CoderBoi Max-CoderBoi closed this by deleting the head repository Mar 15, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant